Einstein’s equations with asymptotically stable constraint propagation
نویسندگان
چکیده
منابع مشابه
Non-cmc Solutions to the Einstein Constraint Equations on Asymptotically Euclidean Manifolds with Apparent Horizon Boundaries
In this article we further develop the solution theory for the Einstein constraint equations on an n-dimensional, asymptotically Euclidean manifold M with interior boundary Σ. Building on recent results for both the asymptotically Euclidean and compact with boundary settings, we show existence of far-from-CMC and near-CMC solutions to the conformal formulation of the Einstein constraints when n...
متن کاملDelay-Dependent Robust Asymptotically Stable for Linear Time Variant Systems
In this paper, the problem of delay dependent robust asymptotically stable for uncertain linear time-variant system with multiple delays is investigated. A new delay-dependent stability sufficient condition is given by using the Lyapunov method, linear matrix inequality (LMI), parameterized first-order model transformation technique and transformation of the interval uncertainty in to the norm ...
متن کاملCriteria for the Trivial Solution of Diierential Algebraic Equations with Small Nonlinearities to Be Asymptotically Stable
Diierential algebraic equations consisting of a constant coeecient linear part and a small nonlinearity are considered. Conditions that enable linearizations to work well are discussed. In particular, for index-2 diierential algebraic equations there results a kind of Perron-Theorem that sounds as clear as its classical model except for the expensive proofs.
متن کاملDynamic Backtracking with Constraint Propagation
Recent works on constraint relaxation [Jussien, 1997; Jussien and Boizumault, 1997b] provided the decorum system (Deduction-based Constraint Relaxation Management). In this paper, we show how the ideas developed in that system can be used in order to integrate Constraint Propagation within the Dynamic Backtracking algorithm [Ginsberg, 1993]. Dynamic Backtracking replaces the backtracking proces...
متن کاملStructural Disambiguation with Constraint Propagation
We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsing is formalized as a constraint satisfaction problem over a finite domain so that efficient constraint-propagation algorithms can be employed to reduce structural ambiguity without generating individual parse trees. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Physics
سال: 1999
ISSN: 0022-2488,1089-7658
DOI: 10.1063/1.532694